Frugal MOOCs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotically optimal frugal colouring

We prove that every graph with maximum degree ∆ can be properly (∆ + 1)-coloured so that no colour appears more than O(log∆/ log log∆) times in the neighbourhood of any vertex. This is best possible up to the constant factor in the O(−) term. We also provide an efficient algorithm to produce such a colouring.

متن کامل

Frugal Colouring of Graphs

A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring was introduced by Hind, Molloy and Reed in 1997. In this paper, we study the frugal chromatic number of planar graphs, planar graphs with large girth, and outerplanar graphs, and relate this parameter with several wel...

متن کامل

Lectures on Frugal Mechanism Design

These lecture notes cover two lectures from EECS 510, Algorithmic Mechanism Design, offered at Northwestern University in the Spring 2008 term. They cover the topic of frugality in mechanism design. Prerequisites for reading these lecture notes are basic understanding of algorithms and complexity as well as elementary calculus and probability theory. I will also assume that the reader has acces...

متن کامل

Fast and frugal framing effects?

Using 3 experiments, we examine whether simple pairwise comparison judgments, involving the recognition heuristic (Goldstein & Gigerenzer, 2002), are sensitive to implicit cues to the nature of the comparison required. In Experiments 1 and 2, we show that participants frequently choose the recognized option of a pair if asked to make "larger" judgments but are significantly less likely to choos...

متن کامل

Frugal Sensor Assignment

When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The International Review of Research in Open and Distributed Learning

سال: 2017

ISSN: 1492-3831

DOI: 10.19173/irrodl.v20i4.3350